Time Cheating in Divisible Load Scheduling: Sensitivity Analysis, Results and Open Problems

An Exhaustive Approach to Release Time Aware Divisible Load Scheduling

An interesting optimization problem is examined where optimal load allocations depend on processor release times, but the timing of release times depends on the load allocation scenario used. This circular relationship between an optimal solution and release times causes system models whose timing relationships may not have an optimal solution. To obtain an optimal solution based on an assumed ...

Divisible Load Scheduling and Markov Chain Models

In this paper the equivalence between various divisible load-scheduling policies and continuous time Markov chains is demonstrated. This provides a basic unification of both data parallel divisible load scheduling and Markov chain models for the first time in 16 years of research. Such equivalence is demonstrated for divisible scheduling on linear daisy chains and single and two level tree netw...

Efficient Real-Time Divisible Load Scheduling with Advance Reservations

Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. With the emergence of Grid applications that require simultaneous access to multi-site resources, supporting advance reservations in a cluster has become increasingly important. While progress is being made in scheduling arbitrarily divis...

Divisible Load Scheduling in Distributed Computing Environments

When attempting to achieve a time-consuming computation it is often advantageous to split the computation amongst multiple machines. Splitting a computation leads to the question of how to divide the load amongst the machines. If we assume that the load can be arbitrarily split and that there are no precedence relations amongst pieces of the load, we call the load divisible. One example of a di...

The Combinatorics in Divisible Load Scheduling